Open Guard Edges and Edge Guards in Simple Polygons
نویسندگان
چکیده
An open edge of a simple polygon is the set of points in the relative interior of an edge. We revisit several art gallery problems, previously considered for closed edge guards, using open edge guards. A guard edge of a polygon is an edge that sees every point inside the polygon. We show that every simple non-starshaped polygon admits at most one open guard edge, and give a simple new proof that it admits at most three closed guard edges. We also characterize open guard edges using a special type of kernel. Finally, we present lower bound constructions for simple polygons with n vertices that require bn/3c open edge guards, and conjecture that this bound is tight.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملSome Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations
This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygon, and the “open” prefix means that the endpoints of such edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to gua...
متن کاملGuarding simple polygons with semi-open edge guards
Let bd(P ) denote the boundary of a simple polygon P . Points p and q of P are mutually visible if segment pq lies entirely inside P . This notion of visibility gave birth to an extensive literature on art-gallery problems [3], concerned with guarding the floor of a polygonal art-gallery. Chvatal [2] showed that bn/3c point guards are always sufficient and sometimes necessary. Allowing guards t...
متن کاملHidden Mobile Guards in Simple Polygons
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most other art gallery problems, existence is the primary question: does a specific type of polygon admit some guard set? Types include simple polygons and the subclasses of orthogonal, monotone, and starshaped polygons. Add...
متن کاملGuarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise-convex polygons, i.e., polygons that are locally convex, except possibly at the vertices, and their edges are convex arcs. We transform the problem of monitoring a piecewise-convex polygon to the problem of 2dominat...
متن کامل